Secure Routing Scheme in MANETs using Secret Key Sharing
نویسندگان
چکیده
منابع مشابه
Secure Routing Scheme in MANETs using Secret Key Sharing
A Mobile Ad-hoc NETwork (MANETs) follows a dynamic topology with distributed architecture. MANETs has no basic infrastructure also has no fixed access point or routers, where in the nodes moves in an undefined manner in a specified area of work. Basically, the distributed dynamic architecture is vulnerable to various kinds of attacks like blackhole, wormhole flooding, etc. Providing a security ...
متن کاملSecure Routing Protocol: Affection on MANETs Performance
In mobile ad hoc networks, the absence ofinfrastructure and the consequent absence of authorizationfacilities impede the usual practice of establishing a practicalcriterion to distinguishing nodes as trusted and distrusted.Since all nodes in the MANETs would be used as router inmulti-hop applications, secure routing protocols have vital rulein the security of the network. So evaluating the perf...
متن کاملUnconditionally Secure Verifiable Secret Sharing Scheme
Abstract A (t, n) secret sharing scheme permits a secret to be divided into n shares in such a way that any t or more than t shares can reconstruct the secret, but fewer than t shares cannot reconstruct the secret. Verifiable secret sharing (VSS) has been proposed to allow each shareholder to verify the validity of his own share, but not other shareholders' shares. In this paper, we propose an ...
متن کاملUnconditionally secure social secret sharing scheme
We introduce the notion of a Social Secret Sharing Scheme, in which shares are allocated based on a player’s reputation and the way he interacts with other participants. During the social tuning phase, weights of players are adjusted such that participants who cooperate will end up with more shares than those who defect. Alternatively, newcomers are able to be enrolled in the scheme while corru...
متن کاملMDS secret-sharing scheme secure against cheaters
For the problem of cheaters in secret sharing schemes, we introduce d cheat which is more appropriate than the minimum Hamming distance d min of the related error correcting code when it is needed only to recover the correct secret s (i.e., when it is not needed to identify the cheaters in the scheme). We then prove that d min d cheat = n ? max B6 2? jBj; where ? denotes the access structure.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Computer Applications
سال: 2011
ISSN: 0975-8887
DOI: 10.5120/2545-3487